• Efficient Mixing of Arbitrary Ballots with Everlasting Privacy: How to Verifiably Mix the PPATC Scheme 

      Gjøsteen, Kristian; Haines, Thomas Edmund; Solberg, Morten Rotvold (Peer reviewed; Journal article, 2021)
      The long term privacy of voting systems is of increasing concern as quantum computers come closer to reality. Everlasting privacy schemes offer the best way to manage these risks at present. While homomorphic tallying ...
    • Hash Proof Based Encryption Schemes in EasyCrypt 

      Solberg, Morten Rotvold (Master thesis, 2018)
      We describe the basics of the proof-assistant \EasyCrypt{} and explain how to use \EasyCrypt{} to model encryption schemes and game-based security proofs. Furthermore, we analyze a generic encryption scheme by Cramer and ...
    • Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co 

      Drăgan, Constantin Cătălin; Dupressoir, François; Estaji, Ehsan; Gjøsteen, Kristian; Haines, Thomas; Ryan, Peter Y. A.; Rønne, Peter B.; Solberg, Morten Rotvold (Chapter, 2022)
      Privacy is a notoriously difficult property to achieve in complicated systems and especially in electronic voting schemes. Moreover, electronic voting schemes is a class of systems that require very high assurance. The ...
    • Security for Electronic Voting Systems 

      Solberg, Morten Rotvold (Doctoral theses at NTNU;2023:381, Doctoral thesis, 2023)